Block classical Gram–Schmidt-based block updating in low-rank matrix approximation
نویسندگان
چکیده
منابع مشابه
Block-row Hankel weighted low rank approximation
This paper extends the Weighted Low Rank Approximation (WLRA) approach towards linearly structured matrices. In the case of Hankel matrices with a special block structure an equivalent unconstrained optimization problem is derived and an algorithm for solving it is proposed.
متن کاملLocal Low-Rank Matrix Approximation
Matrix approximation is a common tool in recommendation systems, text mining, and computer vision. A prevalent assumption in constructing matrix approximations is that the partially observed matrix is of low-rank. We propose a new matrix approximation model where we assume instead that the matrix is locally of low-rank, leading to a representation of the observed matrix as a weighted sum of low...
متن کاملLow Rank Matrix Approximation in Linear Time
Given a matrix M with n rows and d columns, and fixed k and ε, we present an algorithm that in linear time (i.e., O(N)) computes a k-rank matrix B with approximation error ‖M−B‖2F ≤ (1+ ε)μopt(M, k), where N = nd is the input size, and μopt(M, k) is the minimum error of a k-rank approximation to M. This algorithm succeeds with constant probability, and to our knowledge it is the first linear-ti...
متن کاملA Scalable Approach to Column-Based Low-Rank Matrix Approximation
In this paper, we address the column-based low-rank matrix approximation problem using a novel parallel approach. Our approach is based on the divide-andcombine idea. We first perform column selection on submatrices of an original data matrix in parallel, and then combine the selected columns into the final output. Our approach enjoys a theoretical relative-error upper bound. In addition, our c...
متن کاملSchur method for low-rank matrix approximation
The usual way to compute a low-rank approximant of a matrix H is to take its truncated SVD. However, the SVD is computationally expensive. This paper describes a much simpler generalized Schur-type algorithm to compute similar low-rank approximants. For a given matrix H which has d singular values larger than ε, we find all rank d approximants Ĥ such that H − Ĥ has 2-norm less than ε. The set o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TURKISH JOURNAL OF MATHEMATICS
سال: 2018
ISSN: 1300-0098,1303-6149
DOI: 10.3906/mat-1707-14